The longest increasing subsequence in involutions avoiding 3412 and another pattern
نویسندگان
چکیده
Abstract In this note, we study the mean length of longest increasing subsequence a uniformly sampled involution that avoids pattern 3412 and another pattern.
منابع مشابه
The Longest Almost-Increasing Subsequence
Given a sequence of n elements, we introduce the notion of an almost-increasing subsequence as the longest subsequence that can be converted to an increasing subsequence by possibly adding a value, that is at most a fixed constant, to each of the elements. We show how to optimally construct such subsequence in O(n log k) time, where k is the length of the output subsequence.
متن کاملChapter 33 Longest Increasing Subsequence
In this paper we will investigate the connection between random matrices and finding the longest increasing subsequence of a permutation. We will introduce a model for the problem using a simple card game. Then we will talk about Young tableaux and their relation to the symmetric group. Representation theory and power-sum symmetric functions serve as the bridge between this combinatorial constr...
متن کاملThe Dynamic Longest Increasing Subsequence Problem
In this paper, we construct a data structure using a forest of redblack trees to efficiently compute the longest increasing subsequence of a dynamically updated sequence. Our data structure supports a query for the longest increasing subsequence in O(r + logn) worst case time and supports inserts anywhere in the sequence in O (r logn/r) worst case time, where r is the length of the longest incr...
متن کاملOn the length of the longest subsequence avoiding an arbitrary pattern in a random permutation
We consider the distribution of the length of the longest subsequence avoiding an arbitrary pattern, π, in a random permutation of length n. The well-studied case of a longest increasing subsequence corresponds to π = 21. We show that there is some constant cπ such that as n → ∞ the mean value of this length is asymptotic to 2 √ cπn and that the distribution of the length is tightly concentrate...
متن کاملSpace-Efficient Algorithms for Longest Increasing Subsequence
Given a sequence of integers, we want to find a longest increasing subsequence of the sequence. It is known that this problem can be solved in O(n log n) time and space. Our goal in this paper is to reduce the space consumption while keeping the time complexity small. For √ n ≤ s ≤ n, we present algorithms that use O(s log n) bits and O( 1 s · n · log n) time for computing the length of a longe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pure mathematics and applications
سال: 2022
ISSN: ['1218-4586', '1788-800X']
DOI: https://doi.org/10.2478/puma-2022-0032